A Baire function not countably decomposable into continuous functions
نویسندگان
چکیده
منابع مشابه
Formally continuous functions on Baire space
A function from Baire space N to the natural numbers N is called formally continuous if it is induced by a morphism between the corresponding formal spaces. We compare formal continuity to two other notions of continuity on Baire space working in Bishop constructive mathematics: one is a function induced by a Brouwer-operation (i.e. inductively defined neighbourhood function); the other is a fu...
متن کاملDecomposable Submodular Function Minimization: Discrete and Continuous
This paper investigates connections between discrete and continuous approaches for decomposable submodular function minimization. We provide improved running time estimates for the state-of-the-art continuous algorithms for the problem using combinatorial arguments. We also provide a systematic experimental comparison of the two types of methods, based on a clear distinction between level-0 and...
متن کاملCountably Generated Ideals in Rings of Continuous Functions
1. Results. Scattered results about countably2 generated ideals in C(X) are established in [2] and [4] : Op is countably generated if and only if pEX and p has a countable base of neighborhoods; Op is both prime and countably generated if and only if Mp is principal, and if and only if pEX and p is isolated; no lower prime ideal is countably generated. We generalize these as follows: if Mp is c...
متن کاملDecomposing Borel Functions Using the Shore-slaman Join Theorem
Jayne and Rogers proved that every function from an analytic space into a separable metrizable space is decomposable into countably many continuous functions with closed domains if and only if the preimage of each Fσ set under it is again Fσ . Many researchers conjectured that the JayneRogers theorem can be generalized to all finite levels of Borel functions. In this paper, by using the Shore-S...
متن کاملAn Approximation of Jordan Decomposable functions for a Lipschitz Function
The well known Jordan decomposition theorem gives the useful characterization that any function of bounded variation can be written as the difference of two increasing functions. Functions which can be expressed in this way can be used to formulate an exclusion test for the recent Cellular Exclusion Algorithms for numerically computing all zero points or the global minima of functions in a give...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1973
ISSN: 0528-2195
DOI: 10.21136/cpm.1973.117821